package com.aqie.medium.dfs;

import com.aqie.easy.structure.TreeNode;

import java.util.List;

/**
 * 113 路径总和 ：找到所有从根节点到叶子节点路径总和等于给定目标和的路径
 */
public class PathSum {
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        return null;
    }
}
